The classical mathematical puzzle known as the three utilities problem or sometimes water, gas and electricity asks for non-crossing connections to be drawn between three houses and three utility companies in the plane. When posing it in the early 20th century, Henry Dudeney wrote that it was already an old problem. It is an impossible puzzle: it is not possible to connect all nine lines without crossing. Versions of the problem on nonplanar surfaces such as a torus or Möbius strip, or that allow connections to pass through other houses or utilities, can be solved.

This puzzle can be formalized as a problem in topological graph theory by asking whether the complete bipartite graph ${\displaystyle K_{3,3}}$, with vertices representing the houses and utilities and edges representing their connections, has a graph embedding in the plane. The impossibility of the puzzle corresponds to the fact that ${\displaystyle K_{3,3}}$ is not a planar graph. Multiple proofs of this impossibility are known, and form part of the proof of Kuratowski's theorem characterizing planar graphs by two forbidden subgraphs, one of which is ${\displaystyle K_{3,3}}$. The question of minimizing the number of crossings in drawings of complete bipartite graphs is known as Turán's brick factory problem, and for ${\displaystyle K_{3,3}}$ the minimum number of crossings is one.

${\displaystyle K_{3,3}}$ is a graph with six vertices and nine edges, often referred to as the utility graph in reference to the problem. It has also been called the Thomsen graph after 19th-century chemist Julius Thomsen. It is a well-covered graph, the smallest triangle-free cubic graph, and the smallest non-planar minimally rigid graph.